Integral Flow and Cycle Chip-Firing on Graphs

نویسندگان

چکیده

Motivated by the notion of chip-firing on dual graph a planar graph, we consider ‘integral flow chip-firing’ an arbitrary G. The rule is governed $${\mathcal {L}}^*(G)$$ , Laplacian G determined choosing basis for lattice integral flows We show that any admits such so M-matrix, leading to firing these elements avalanche finite. This follows from more general result bases lattices may be independent interest. Our results provide z-superstable configurations are in bijection with set spanning trees graphs, as well graphs $$K_5$$ and $$K_{3,3}$$ one can find M-basis consists cycles underlying graph. question address some open questions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chip-firing Games on Graphs

We analyze the following (solitaire) game: each node of a graph contains a pile of chips, and a move consists of selecting a node with at least as many chips on it as its degree, and let it send one chip to each of its neighbors. The game terminates if there is no such node. We show that the finiteness of the game and the terminating configuration are independent of the moves made. If the numbe...

متن کامل

Chip-Firing and Rotor-Routing on Directed Graphs

We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.

متن کامل

Chip-firing games, potential theory on graphs, and spanning trees

We study the interplay between chip-firing games and potential theory on graphs, characterizing reduced divisors (G-parking functions) on graphs as the solution to an energy (or potential) minimization problem and providing an algorithm to efficiently compute reduced divisors. Applications include an “efficient bijective” proof of Kirchhoff’s matrix-tree theorem and a new algorithm for finding ...

متن کامل

The halting problem for chip-firing on finite directed graphs

We consider a chip-firing game on finite directed graphs and give an answer to a question posed by Bjorner, Lovasz, and Shor in 1991: given an initial configuration of chips, when does it stabilize? The approach they took to address this halting problem involves computing a period vector p with the property that toppling the vertices according to p results in the original configuration, and the...

متن کامل

Parallel Chip Firing on Digraphs

Given some multidigraph , a state is any dist ribut ion of some chips on its vert ices. We transform t his initial st ate step by step. Every vert ex checks whet her it is able to send one chip through every outgoing arc. If it can, it does; otherwise it does not send any chip. All vert ices check and send in parallel. Finally, at every vert ex all incoming chips are added to the remaining chip...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Combinatorics

سال: 2021

ISSN: ['0219-3094', '0218-0006']

DOI: https://doi.org/10.1007/s00026-021-00542-7